Feasible and Infeasible Maxima in a Quadratic Program for Maximum Clique
نویسندگان
چکیده
In 1965, Motzkin and Straus related global maximaof a certain quadratic program to the maximum clique size in a certain graph. We extend this result to relate strict local maxima of this program to certain maximal cliques, and certain maxima to non cliques. Our results are useful to a companion paper which employs this QP in a neural net model to nd large cliques in graphs.
منابع مشابه
Continuous quadratic programming formulations of optimization problems on graphs
Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This continuous formulation is compared to known continuous quadratic programming formulations for the edge sepa...
متن کاملApproximating Global Quadratic Optimization with Convex Quadratic Constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to convex non-homogeneous quadratic constraints. We prove an approximation quality bound that is related to a condition number of the convex feasible set; and it is the currently best for approximating certain problems, such as quadratic optimization over the assignment polytope, according to the bes...
متن کاملContinuous Characterizations of the Maximum Clique
Given a graph G whose adjacency matrix is A, the Motzkin-Strauss formulation of the Maximum-Clique Problem is the quadratic program maxfxTAxjxT e = 1; x 0g. It is well known that the global optimum value of this QP is (1 1=!(G)), where !(G) is the clique number of G. Here, we characterize the following: 1) rst order optimality 2) second order optimality 3) local optimality 4) strict local. Thes...
متن کاملContinuous Characterizations of the Maximum Clique Problem 1
Given a graph G whose adjacency matrix is A, the Motzkin-Strauss formulation of the Maximum-Clique Problem is the quadratic program maxfx T Axjx T e = 1; x 0g. It is well known that the global optimum value of this QP is (1 ? 1=!(G)), where !(G) is the clique number of G. Here, we characterize the following: 1) rst order optimality 2) second order optimality 3) local optimality 4) strict local ...
متن کاملA Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points
An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995